<html>
 <head>
  <link href="./leetcode-problem.css" rel="stylesheet" type="text/css">
 </head>
 <body>
  <div class="question_difficulty">
   难度：Easy
  </div>
  <div>
   <h1 class="question_title">
    448. Find All Numbers Disappeared in an Array
   </h1>
   <p>
    Given an array of integers where 1 &le; a[i] &le;
    <i>
     n
    </i>
    (
    <i>
     n
    </i>
    = size of array), some elements appear twice and others appear once.
   </p>
   <p>
    Find all the elements of [1,
    <i>
     n
    </i>
    ] inclusive that do not appear in this array.
   </p>
   <p>
    Could you do it without extra space and in O(
    <i>
     n
    </i>
    ) runtime? You may assume the returned list does not count as extra space.
   </p>
   <p>
    <b>
     Example:
    </b>
   </p>
   <pre>
<b>Input:</b>
[4,3,2,7,8,2,3,1]

<b>Output:</b>
[5,6]
</pre>
  </div>
  <div>
   <h1 class="question_title">
    448. 找到所有数组中消失的数字
   </h1>
   <p>
    给定一个范围在&nbsp; 1 &le; a[i] &le;
    <em>
     n
    </em>
    (&nbsp;
    <em>
     n
    </em>
    = 数组大小 ) 的 整型数组，数组中的元素一些出现了两次，另一些只出现一次。
   </p>
   <p>
    找到所有在 [1,
    <em>
     n
    </em>
    ] 范围之间没有出现在数组中的数字。
   </p>
   <p>
    您能在不使用额外空间且时间复杂度为
    <em>
     O(n)
    </em>
    的情况下完成这个任务吗? 你可以假定返回的数组不算在额外空间内。
   </p>
   <p>
    <strong>
     示例:
    </strong>
   </p>
   <pre>
<strong>输入:</strong>
[4,3,2,7,8,2,3,1]

<strong>输出:</strong>
[5,6]
</pre>
  </div>
 </body>
</html>